Degree Distribution of an Inhomogeneous Random Intersection Graph
نویسندگان
چکیده
منابع مشابه
Degree Distribution of an Inhomogeneous Random Intersection Graph
We show the asymptotic degree distribution of the typical vertex of a sparse inhomogeneous random intersection graph.
متن کاملVertex Degree of Random Intersection Graph
A random intersection graph is constructed by independently assigning a subset of a given set of objects W, to each vertex of the vertex set V of a simple graph G. There is an edge between two vertices of V, iff their respective subsets(in W ,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set V, is derived. Also we dete...
متن کاملDegree distribution of a typical vertex in a general random intersection graph
For a general random intersection graph we show an approximation of the vertex degree distribution by a Poisson mixture. key words: intersection graph, random graph, degree distribution
متن کاملEpidemic on Reed-frost Random Intersection Graph with Tunable Degree Distribution and Clustering
A branching processes approximation for the spread of a Reed-Frost epidemic on a network with tunable clustering is derived. The approximation gives rise to expressions for the epidemic threshold and the probability of a large outbreak in the epidemic. A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two ver...
متن کاملThe Largest Component in an Inhomogeneous Random Intersection Graph with Clustering
Given integers n and m = ⌊βn⌋ and a probability measure Q on {0, 1, . . . ,m}, consider the random intersection graph on the vertex set [n] = {1, 2, . . . , n} where i, j ∈ [n] are declared adjacent whenever S(i)∩S(j) 6= ∅. Here S(1), . . . , S(n) denote the iid random subsets of [m] with the distribution P(S(i) = A) = (m |A| −1 Q(|A|), A ⊂ [m]. For sparse random intersection graphs, we establi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2786